Query Evaluation and Progression in AOL Knowledge Bases
نویسندگان
چکیده
Recently Lakemeyer and Levesque proposed the logic AOL, which amalgamates both the situation calculus and Levesque’s logic of only knowing. While very expressive the practical relevance of the formalism is unclear because it heavily relies on second-order logic. In this paper we demonstrate that the picture is not as bleak as it may seem. In particular, we show that for large classes of AOL knowledge bases and queries, including epistemic ones, query evaluation requires first-order reasoning only. We also provide a simple semantic definition of progressing a knowledge base. For a particular class of knowledge bases, adapted from earlier results by Lin and Reiter, we show that progression is first-order representable and easy to compute.
منابع مشابه
Query Evaluation and Progression in Knowledge Bases
Recently Lakemeyer and Levesque proposed the logic , which amalgamates both the situation calculus and Levesque’s logic of only knowing. While very expressive the practical relevance of the formalism is unclear because it heavily relies on second-order logic. In this paper we demonstrate that the picture is not as bleak as it may seem. In particular, we show that for large classes of knowledge ...
متن کاملDiscovering Popular Clicks\' Pattern of Teen Users for Query Recommendation
Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...
متن کاملAcquiring knowledge about human goals from Search Query Logs
A better understanding of what motivates humans to perform certain actions is relevant for a range of research challenges including generating action sequences that implement goals (planning). A first step in this direction is the task of acquiring knowledge about human goals. In this work, we investigate whether Search Query Logs are a viable source for extracting expressions of human goals. F...
متن کاملEfficient Reasoning in Multiagent Knowledge Bases
In many applications, agents must reason about what other agents know, whether to coordinate with them or to come out on top in a competitive situation. However in general, reasoning in a multiagent epistemic logic such as Kn has high complexity. In this paper, we look at a restricted class of knowledge bases that are sets of modal literals. We call these proper epistemic knowledge bases (PEKBs...
متن کاملAccelerating Rule-Based Reasoning in Disk-Resident RDF Knowledge Bases
Collections of tens of millions of automatically extracted facts represented using the subject-predicate-object RDF model are available for several domains. As big as these collections are, they are unable to capture all information about a domain, simply because the sources from which they were extracted are incomplete. This can be tackled by creating knowledge bases where facts are enforced w...
متن کامل